A domain decomposition algorithm for contact problems with Coulomb’s friction

نویسندگان

  • J. Haslinger
  • R. Kučera
  • T. Sassi
چکیده

Contact problems of elasticity are used in many fields of science and engineering, especially in structural mechanics, geology and biomecanics. Many numerical procedures solving contact problems have been proposed in the engineering literature. They are based on standard discretization techniques for partial differential equations in combination with a special implementation of non-linear contact conditions (e.g., see [3, 5, 6, 8]). The use of domain decomposition methods turns out to be one of the most efficient approaches. Recently, Dirichlet-Neumann and FETI type algorithms have been proposed and studied for solving multibody contact problems with Coulomb friction (see for example [7, 1, 2]). In this paper, the Neumann-Neumann algorithm is extended to two-body contact problems with Coulomb friction. The main difficulty is due to the boundary conditions at the contact interface. They are highly non-linear, both in the normal direction (unilateral contact conditions) and in the tangential one (Coulomb’s law). A fixed point procedure is introduced to ensure the continuity of the contact stresses. Numerical results illustrate that an optimal relaxation parameter exists and its value is nearly independent of the friction coefficient and the mesh size.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

PENALTY METHOD FOR UNILATERAL CONTACT PROBLEM WITH COULOMB’S FRICTION FOR LOCKING MATERIAL

In this work, we study a unilateral contact problem with non local friction of Coulombbetween a locking material and a rigid foundation. In the first step , we present the mathematicalmodel for a static process, we establish the variational formulation in the form of a variationalinequality and we prove the existence and uniqueness of the solution. In the second step, usingthe penalty method we...

متن کامل

A domain decomposition method for two-body contact problems with Tresca friction

The paper analyzes a continuous and discrete version of the Neumann-Neumann domain decomposition algorithm for two-body contact problems with Tresca friction. Each iterative step consists of a linear elasticity problem for one body with displacements prescribed on a contact part of the boundary and a contact problem with Tresca friction for the second body. To ensure continuity of contact stres...

متن کامل

Numerically and parallel scalable TFETI algorithms for quasistatic contact

This paper deals with the solution of the discretized quasistatic 3D Signorini problems with local Coulomb friction. After a time discretization we obtain a system of static contact problems with Coulomb friction. Each of these problems is decomposed by the TFETI domain decomposition method used in auxiliary contact problemswith Tresca friction. The algebraic formulation of these problems in 3D...

متن کامل

Uzawa Block Relaxation Domain Decomposition Method for the Two-Body Contact Problem With Tresca Friction

We propose a Uzawa block relaxation domain decomposition method for a two-body contact problem with Tresca friction. We introduce auxiliary interface unknowns to transform the variational problem into a saddle-point problem. Applying a Uzawa block relaxation algorithm to the corresponding augmented Lagrangian functional we obtain a domain decomposition algorithm in which we have to solve two un...

متن کامل

On Domain Decomposition Algorithms for Contact Problems with Tresca Friction

Development of numerical methods for the solution of contact problems is a challenging task whose difficulty lies in the non-linear conditions for non-penetration and friction. Recently, many authors proposed to use various numerical algorithms combined with multigrid or domain decomposition techniques; see, e.g., the primal-dual active set algorithm [8], the non-smooth multiscale method [10], ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013